A Comparative Study of Some Ingenious Sorting Algorithms on Modern Architectures
نویسندگان
چکیده
Heapsort, Quicksort and Mergesort are three ingenious sorting algorithms, which deserve special attention. In the past these algorithms were studied in detail, but the study was carried out on old machines and involved cache simulations. Over the years computer architecture has gone through radical changes. Therefore, a study valid on old architectures may not be valid on new architectures. The comparative study of Heapsort, Quicksort and Mergesort on modern machines with the help of latest performance analyzers is the central idea of the paper. To choose among Heapsort , Quicksort and Mergesort on modern machines, a comparative study of prior will be useful. Quicksort has been a usual choice for sorting, but some researchers suggest that accelerated Heapsort, a variant of Heapsort, is competitive enough to become a method of choice to solve sorting problem [6]. This paper examines the claim of accelerated Heapsort as a method of choice.
منابع مشابه
An Efficient Multiway Mergesort for GPU Architectures
Sorting is a primitive operation that is a building block for countless algorithms. As such, it is important to design sorting algorithms that approach peak performance on a range of hardware architectures. Graphics Processing Units (GPUs) are particularly attractive architectures as they provides massive parallelism and computing power. However, the intricacies of their compute and memory hier...
متن کاملA Comparative Study of Some Clustering Algorithms on Shape Data
Recently, some statistical studies have been done using the shape data. One of these studies is clustering shape data, which is the main topic of this paper. We are going to study some clustering algorithms on shape data and then introduce the best algorithm based on accuracy, speed, and scalability criteria. In addition, we propose a method for representing the shape data that facilitates and ...
متن کاملReliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)
Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...
متن کاملSorting in the Presence of Branch Prediction and Caches Fast Sorting on Modern Computers
Sorting is one of the most important and studied problems in computer science. Many good algorithms exist which offer various trade-offs in efficiency, simplicity and memory use. However most of these algorithms were discovered decades ago at a time when computer architectures were much simpler than today. Branch prediction and cache memories are two developments in computer architecture that h...
متن کاملA Statistical Comparative Study of Some Sorting Algorithms
This research paper is a statistical comparative study of a few average case asymptotically optimal sorting algorithms namely, Quick sort, Heap sort and Ksort. The three sorting algorithms all with the same average case complexity have been compared by obtaining the corresponding statistical bounds while subjecting these procedures over the randomly generated data from some standard discrete an...
متن کامل